Determining Arc Segment Significance in Two Idealized Road Networks
نویسندگان
چکیده
As road networks become increasingly congested, accurate information regarding their vulnerability to an amalgamation of situations becomes more vital. Understanding how accidents, routine closures (due to construction, public events, etc) and even premeditated attacks on individual arcs influence the road network may assist policy makers in decisions on network expansion or planning, helping to ensure the development of a more robust, reliable, and protected network. This paper discusses a method for determining arc segment significance within two idealized networks using SPCP (Shortest Path Counting Problem) and DSPCP (Directed Shortest Path Counting Problem) as an analytical basis.
منابع مشابه
Analysis of the Road Traffic Based on SPCP
The transportation of people and goods has been necessary in any society for thousands of years. In modern times, transportation has become a foundation component of human activity. A great deal of problems related to traffic and transportation have been ingeniously resolved in the past and perhaps an even greater number of problems will have to be overcome in the future. Now it has been realiz...
متن کاملCombining Float Car Data and Multispectral Satellite Images to Extract Road Features and Networks
This chapter presents an automatic methodology for the extraction of spatial road features and networks from floating car data (FCD) that was integrated with multispectral remote sensing images in metropolitan areas. This methodology is divided into two basic steps. Firstly, a spatial local statistical examination is carried out to extract the nodes of each road segment. Based on the local Mora...
متن کاملFully Dynamic Maintenance of Arc-Flags in Road Networks
The problem of finding best routes in road networks can be solved by applying Dijkstra’s shortest paths algorithm. Unfortunately, road networks deriving from real-world applications are huge yielding unsustainable times to compute shortest paths. For this reason, great research efforts have been done to accelerate Dijkstra’s algorithm on road networks. These efforts have led to the development ...
متن کاملIdentification of High Crash Road Segment using Genetic Algorithm and Dynamic Segmentation
This paper presents an evolutionary algorithm for recognizing high and low crash road segments using Genetic Algorithm as a dynamic segmentation method. Social and economic costs as well as physical and mental injuries make the governments perceiving to road safety indexes in order to diminish the consequences of road accidents. Due to the limitation of budget for safety...
متن کاملDynamic Arc-Flags in Road Networks
In this work we introduce a new data structure, named RoadSigns, which allows us to efficiently update the Arc-Flags of a graph in a dynamic scenario. Road-Signs can be used to compute Arc-Flags, can be efficiently updated and do not require large space consumption for many real-world graphs like, e.g., graphs arising from road networks. In detail, we define an algorithm to preprocess Road-Sign...
متن کامل